Communication method and communication device

ABSTRACT

The communication method using an almost periodic function code includes using, for modulation, almost periodic function codes the number of which is in accordance with the number of users or the number of channels, among K almost periodic function codes. Where k is an integer from 1 to K and is an identifier for identifying each of the K almost periodic function codes, a parameter that determines each of the K almost periodic function codes is represented by δ+(k−1)/K. The symbol K is N or 2N, where N is a code length of each almost periodic function code. The symbol δ is a real number greater than 0 and less than 1/N.

TECHNICAL FIELD

The present invention relates to communication using almost periodic function codes.

BACKGROUND ART

An almost periodic function is obtained by generalizing Fourier series expansion. The almost periodic function is formed as a sum of signals having a frequency that is an m-th prime number p(m) raised to the ½ power, for example. Such signals have not been used in communications conventionally, but Non Patent Literature 1 proposes application thereof to communications for the first time.

Non Patent Literature 1 discloses multiple access communication using codes (almost periodic function codes) based on an almost periodic function. It is noted that, in Non Patent Literature 1, the codes based on an almost periodic function are referred to as almost periodic spreading sequence (APSS).

CITATION LIST Non Patent Literature

-   NON PATENT LITERATURE 1: Umeno, Ken, “Spread Spectrum Communications     Based on Almost Periodic Functions: Almost Periodic Code Approach     versus Chaotic Code Approach for Communications”, IEICE technical     report, vol. 114, no. 250, NLP2014-64, pp. 87-90 (2014), Institute     of Electronics, Information and Communication Engineers

SUMMARY OF INVENTION Technical Problem

Relevant literature, Tsuda Hiroshi, Umeno Ken, “configuration and evaluation of optimum Weyl codes for CDMA”, proceeding of the Japan Society for Industrial and Applied Mathematics (2015), published by the present inventors proposes optimization of almost periodic function codes (Weyl codes) using a Weyl sequence. More specifically, the relevant literature discloses optimization of ρ_(k) which is a parameter (initial value) that determines a Weyl code for each user. The relevant literature reports that, in a case where the number of users in communication is K, the intervals between the parameters (initial values) ρ_(k) given to respective users k are set to equal intervals of 1/K, whereby the bit error rate can be reduced.

The almost periodic function code described in the relevant literature is a code using a Weyl sequence which is an irrational number sequence, and therefore, as a premise, the parameter (initial value) ρ_(k) given to each user is an irrational number.

However, the parameter that determines the almost periodic function code need not be limited to an irrational number. The present invention is based on such conception.

Solution to Problem

One aspect of the present invention is a communication method using an almost periodic function code, the communication method including using, for modulation, almost periodic function codes a number of which is in accordance with a number of users or a number of channels, among K almost periodic function codes. Here, the communication includes broadcasting.

In an embodiment, where k is an integer from 1 to K and is an identifier for identifying each of the K almost periodic function codes, a parameter that determines each of the K almost periodic function codes is represented by δ+(k−1)/K. Here, K is N or 2N, where N is a code length of each almost periodic function code, and preferably, δ is a real number greater than 0 and less than 1/N.

Preferably, δ is in a range of ¼N≤δ≤¾N, and more preferably, δ is ½N.

Preferably, δ is in a range of ⅛N≤δ≤⅜N, and more preferably, δ is ¼N.

Preferably, δ is in a range of ⅝N≤δ≤⅞N, and more preferably, δ is ¾N.

Preferably, δ is a rational number.

Another aspect of the present invention is a communication device performing communication using an almost periodic function code, the communication device including a modulator configured to use, for modulation, almost periodic function codes a number of which is in accordance with a number of users or a number of channels, among K almost periodic function codes.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram showing a communication device.

FIG. 2 is a diagram showing K almost periodic function codes.

FIG. 3 is a graph showing an autocorrelation value.

FIG. 4 is a diagram obtained by plotting almost periodic function codes on a complex plane.

FIG. 5 is graphs showing a result of simulation of bit error rates.

DESCRIPTION OF EMBODIMENTS

[1. Outline of Communication Device]

Hereinafter, embodiments will be described with reference to the drawings. FIG. 1 shows a communication device 10 for spread spectrum communication using almost periodic function codes. The communication device 10 includes a modulator 20 for modulating a transmission signal. The modulator 20 outputs a modulated signal by multiplying a transmission signal with an almost periodic function code. Transmission data may be subjected to primary modulation such as BPSK, QPSK, or 16QAM. The modulated signal outputted from the modulator 20 is received by another communication device through a signal transmission path and modulated.

[2. Almost Periodic Function Code]

An almost periodic function code w_(k)[n] is represented by the following expression (1). [Mathematical 1] w _(k)[n]=exp(2πi×n×ρ _(k))  (1)

Here, the symbol k is an identifier for code and is an integer from 1 to K (1≤k≤K). The symbol K is the number of users or the number of channels. The symbol k is also used as an identifier for a user or a channel to which the code w_(k)[n] is assigned.

The symbol n is an identifier for an element included in a code and is an integer from 1 to N (1≤n≤N). The symbol N is a code length.

The symbol i is the imaginary unit.

The symbol ρ_(k) is a parameter (initial value) that determines the code w_(k)[n], and takes different values for respective codes w_(k)[n].

FIG. 2 shows the codes w_(k)[n] represented by expression (1). FIG. 2 shows K codes (code sequence) w_(k)[n] having a code length N. Each code w_(k)[n] has N elements. As is obvious from expression (1) and FIG. 2, the value of the code w_(k)[n] is determined by the parameter ρ_(k).

The Weyl code (see Non Patent Literature 1 and the relevant literature) using a Weyl sequence is obtained by using a Weyl sequence x_(k)[n] represented by expression (2) as n×ρ_(k) in expression (1). The Weyl sequence is quasi-random numbers and is based on Weyl's uniform distribution theorem that the fractional part of an integer multiple of an irrational number is uniformly distributed in an interval [0,1). [Mathematical 2] x _(k)[n]=√{square root over (p _(k))}×n(mod 1)  (2)

Here, the symbol p_(k) is a prime number assigned to the user k.

The relevant literature discloses optimization of the parameter ρ_(k) assigned to the user k, in the Weyl code. In the relevant literature, the new Weyl code optimized is represented by the following expression (3).

[Mathematical  3] $\begin{matrix} {{w_{k}\lbrack n\rbrack} = {\exp\left( {2\pi\;{{in}\left( {\delta + \frac{k - 1}{K}} \right)}} \right)}} & (3) \end{matrix}$

Here, the symbol δ is an irrational number included in an interval not less than 0 but less than 1 (0≤δ<1).

In expression (3), (δ+(k−1)/K) corresponds to ρ_(k) in expression (1). That is, ρ_(k)=(δ+(k−1)/K) is satisfied. Expression (3) means that, in a case where the number of users in communication is K, the interval between the parameters (initial values) ρ_(k) given to the respective users k is set to equal intervals of 1/K. As reported by the relevant literature, the Weyl code of expression (3) allows optimization of cross-correlation value, leading to reduction in the bit error rate. It is noted that δ is equal to the parameter ρ_(k) assigned to the user of k=1. In the relevant literature, the symbol K indicates the number of users, but may indicate the number of channels.

Expression (3) is based on the premise that the Weyl sequence which is an irrational number sequence is used, and therefore, in the relevant literature, δ is defined as an irrational number as described above. If δ is an irrational number, ρ_(k) is also an irrational number. If ρ_(k) is an irrational number, the uniform distribution theorem is satisfied even when the code length N is infinity.

However, in a case of using the Weyl sequence for communication, the code length N is a finite length. Therefore, it is sufficient that n×(δ+(k−1)K) in expression (3) is discretely and uniformly distributed when n takes values up to the code length N. Accordingly, in a case of using the Weyl sequence for communication, the uniform distribution theorem need not be satisfied in an exact sense. Since the uniform distribution theorem need not be satisfied, δ in expression (3) need not be an irrational number, but may be a rational number. Therefore, δ in expression (3) can be extended to a real number including a rational number. In addition, even if δ in expression (3) is defined as an irrational number, δ is treated as a rational number in a process by a computer. Therefore, it is practical to define δ as a real number.

The new Weyl code extended is represented by expression (1) in which the parameter (initial value) ρ_(k) is defined as shown by the following expression (4).

[Mathematical  4] $\begin{matrix} {\rho_{k} = {\delta + \frac{k - 1}{K}}} & (4) \end{matrix}$

Here, the symbol δ is a real number not less than 0 but less than 1 (0≤δ<1).

Since δ is a real number, the parameter ρ_(k) in expression (4) also becomes a real number. If ρ_(k) is extended to a real number as shown in expression (4), it becomes easy to determine a more preferable value of ρ_(k). The present inventors have found a more appropriate parameter ρ_(k) in consideration of the autocorrelation value of the code w_(k)[n], while extending ρ_(k) to a real number. It is noted that the autocorrelation value of the code w_(k)[n] is an index used when the communication device that has received a modulated signal searches for a start position of the code w_(k)[n] in the received signal.

In a case where the parameter ρ_(k) is a real number, the autocorrelation value of the code w_(k)[n] in expression (1) is represented by the following expression (5). In expression (5), the symbol 1 (0≤1≤N) is the shift amount of the code.

     [Mathematical  5] $\begin{matrix} {{\frac{1}{N}{\sum\limits_{n = 1}^{N - 1}\;{{\exp\left( {2\pi\;{i\left( {n + l} \right)}\rho_{k}} \right)}{\exp\left( {{- 2}\pi\;{in}\;\rho_{k}} \right)}}}} + {\frac{1}{N}{\sum\limits_{n = 1}^{l}\;{{\exp\left( {2\pi\;{in}\;\rho_{k}} \right)}{\exp\left( {{- 2}\pi\;{i\left( {N - l + n} \right)}\rho_{k}} \right)}}}}} & (5) \end{matrix}$

By arranging expression (5), the following expression (6) is obtained.

[Mathematical  6] $\begin{matrix} {= {{\frac{1}{N}{\sum\limits_{n = 1}^{N - 1}\;{\exp\left( {2\pi\;{il}\;\rho_{k}} \right)}}} + {\frac{1}{N}{\sum\limits_{n = 1}^{l}\;{\exp\left( {{- 2}\pi\;{i\left( {N - l} \right)}\rho_{k}} \right)}}}}} & (6) \end{matrix}$

The autocorrelation value does not depend on the variable n, and therefore expression (6) can be deformed into expression (7).

[Mathematical  7] $\begin{matrix} {= {{\frac{N - l}{N}{\exp\left( {2\pi\;{il}\;\rho_{k}} \right)}} + {\frac{1}{N}{\exp\left( {{- 2}\pi\;{i\left( {N - l} \right)}\rho_{k}} \right.}}}} & (7) \end{matrix}$

The magnitude of the autocorrelation value is represented by the following expression (8) on the basis of expression (7).

[Mathematical  8] $\begin{matrix} \sqrt{\left( \frac{N - l}{N} \right)^{2} + \left( \frac{l}{N} \right)^{2} + {\frac{2{l\left( {N - l} \right)}}{N^{2}}{\cos\left( {2\pi\; N\;\rho_{k}} \right)}}} & (8) \end{matrix}$

In order to search for the start position of the code in the received signal, it is desirable that the magnitude of the autocorrelation value is as small as possible. Accordingly, here, the value represented by expression (8) is minimized. The first term and the second term in the radical sign in expression (8) cannot be minimized. Therefore, minimization of expression (8) can be achieved by minimization of cos(2πNρ_(k)) included in the third term in the radical sign in expression (8), for example. That is, cos(2πNρ_(k)) is made to be always “−1”. Therefore, cos(2πNρ_(k)) can be minimized by satisfying the following expression (9), using the variable k (k≥1) indicating a user or a channel. [Mathematical 9] 2πNρ _(k)=π+2(k−1)π  (9)

By solving expression (9) for ρ_(k), expression (10) is obtained.

[Mathematical  10] $\begin{matrix} {\rho_{k} = {\frac{1}{2N} + \frac{k - 1}{N}}} & (10) \end{matrix}$

If the parameter ρ_(k) shown by expression (10) is used as ρ_(k) in expression (1), the autocorrelation value can be minimized.

Expression (10) corresponds to an expression obtained by setting δ in expression (4) to ½N and setting the number K of users or the number K of channels in expression (4) to the same magnitude as the code length N. FIG. 3 shows the autocorrelation value in a case of setting δ to ½N. In FIG. 3, the horizontal axis indicates a shift 1 of the code. Here, the code length N is set as N=128, the shift 1 takes values of 0 to 128. In FIG. 3, the vertical axis indicates the autocorrelation value. As shown in FIG. 3, in a case of δ=½N, it is found that, at the position where the shift 1 is 64 (shift that is half the code length N=128), the autocorrelation value becomes 0 and the autocorrelation value can be minimized.

In addition, since the second term in expression (10) is (k−1)/N, the intervals between the parameters ρ_(k) are equal intervals of 1/N. Accordingly, when the number K of users or the number K of channels is the same value as the code length N, expression (10) satisfies expression (4). Therefore, while the maximum value of the number K of users or the number K of channels is limited to the same value as the code length N, if communication is performed using the code w_(k)[n] obtained by using the parameter ρ_(k) of expression (10) as ρ_(k) in expression (1), an effect of reducing the bit error rate is obtained.

FIG. 4 shows first (n=1) elements w_(k)[1] in the codes w_(k)[n] using the parameters ρ_(k) according to expression (10), on a complex plane. Here, a case of K=7, i.e., a case where the number of codes w_(k)[n] is 7, is shown. Since the intervals between the parameters ρ_(k) determined in accordance with expression (10) are equal intervals of 1/N, the intervals between the codes w_(k)[n] are also equal intervals on the complex plane, and discrete uniform distribution is obtained on a circle on the complex plane. In addition, as shown in FIG. 4, δ=½N in expression (10) determines the phase of w₁[1] from the real axis.

It is noted that, since expression (9) is a condition that cos(2πNρ_(k)) takes a constant value of “−1” irrespective of the user k or the channel k, a preferable situation (constant autocorrelation value) is obtained in which the autocorrelation value of the code w_(k)[n] using ρ_(k) of expression (10) obtained from expression (9) becomes constant irrespective of the user k or the channel k.

Here, it is preferable that the autocorrelation value is minimized, but even if the autocorrelation value is not minimized, it is possible to search for the start position of the code as long as the autocorrelation value is smaller than 1. Therefore, unless minimization of the autocorrelation value is particularly desired, it is possible to relax the condition for the first term (½N) in expression (1) while keeping the second term ((k−1)/N) in expression (10) for obtaining the effect of reducing the bit error rate.

In order to make the autocorrelation value of the code w_(k)[n] constant irrespective of the user k or the channel k (achieve constant autocorrelation value), cos(2πNρ_(k)) in expression (8) is set to have a constant value irrespective of the user k or the channel k. Therefore, it suffices that, when π in expression (9) is generalized by θ (0<θ<2π), θ is a constant not including the variable k.

If π in expression (9) is generalized by θ, the following expression (11) is obtained. [Mathematical 11] 2πNρ _(k)θ+2(k−1)π  (11)

By solving expression (11) for ρ_(k), expression (12) is obtained.

[Mathematical  12] $\begin{matrix} {\rho_{k} = {\frac{\theta}{2\pi\; N} + \frac{k - 1}{N}}} & (12) \end{matrix}$

The second term ((k−1)/N) in expression (12) is the same as the second term in expression (10). In addition, from 0<θ<2π, the range of the first term ((θ/2πN)=δ) in expression (12) is represented by expression (13).

[Mathematical  13] $\begin{matrix} {0 < \frac{\theta}{2\pi\; N} < \frac{1}{N}} & (13) \end{matrix}$

Therefore, if (θ/2πN) in expression (12) is replaced with δ, the parameter ρ_(k) is represented by the following expression (14).

[Mathematical  14] $\begin{matrix} {\rho_{k} = {\delta + \frac{k - 1}{N}}} & (14) \end{matrix}$

Here, δ is a real number greater than 0 and less than 1/N (0<δ<1/N).

The code w_(k)[n] obtained by using the parameter ρ_(k) of expression (14) as ρ_(k) in expression (1) can achieve reduction of the bit error rate and achieve a constant autocorrelation value.

Even though the autocorrelation value of the code w_(k)[n] is not minimized, it is preferable that the autocorrelation value is as small as possible. From the perspective of causing the autocorrelation value to be a sufficiently small value, e.g., about 0.5, cos(2πNρ_(k)) in expression (8) is set to 0 or less. In this case, the range of θ in expression (12) is it/2≤θ≤3/2π. In this case, the range of the first term ((θ/2πN)=δ) in expression (12) is represented by expression (15).

[Mathematical  15] $\begin{matrix} {\frac{1}{4N} \leq \frac{\theta}{2\pi\; N} \leq \frac{3}{4N}} & (15) \end{matrix}$

Thus, δ (=θ/2πN) is a real number not less than ¼N and not greater than ¾N (¼N≤δ≤¾N). In this case, it is possible to sufficiently reduce the autocorrelation value while achieving reduction of the bit error rate and achieving a constant autocorrelation value. FIG. 3 shows the autocorrelation value in a case of δ=¼N, and it is found that, at the position where the shift 1 is 64 (shift that is half the code length N=128), the autocorrelation value is about 0.5. Also in a case of δ=¾N, the same autocorrelation value as in the case of δ=¼N is obtained. Therefore, in the range of ¼N≤δ≤¾N, the autocorrelation value becomes a value between the autocorrelation value for δ=½N and the autocorrelation value for δ=¼N.

In actual communication, a transmission bit to be subjected to modulation using the code wk[n] takes a value such as “+1” or “−1” according to information to be transmitted. In order to prevent the autocorrelation from varying depending on the value of the transmission bit, it is preferable to set cos(2πρk) in expression (8) to be always “0” so that expression (8) has a constant value irrespective of the value of the transmission bit.

The condition that cos(2πρk) always becomes “0” is represented by the following expression (16) using the variable k (k≥1) indicating a user or a channel as in expression (9).

[Mathematical  16] $\begin{matrix} {{2\pi\; N\;\rho_{k}} = {\frac{\pi}{2} + {\left( {k - 1} \right)\pi}}} & (16) \end{matrix}$

By solving expression (16) for ρ_(k), expression (17) is obtained.

[Mathematical  17] $\begin{matrix} {\rho_{k} = {\frac{1}{4N} + \frac{k - 1}{2N}}} & (17) \end{matrix}$

Expression (17) corresponds to an expression obtained by setting δ in expression (4) to ¼N and setting the number K of users or the number K of channels in expression (4) to 2N (twice the code length).

Since the second term in expression (17) is (k−1)/2N, the intervals between the parameters ρ_(k) are equal intervals of ½N. Thus, the number K of users or the number K of channels may be 2N. However, if the number K of users or the number K of channels increases, the effect of reducing the bit error rate decreases. Therefore, from the perspective of reducing the bit error rate, setting the number K of users or the number K of channels to N is more advantageous. Accordingly, by setting 2N of the second term in expression (17) to N, expression (18) is obtained.

[Mathematical  18] $\begin{matrix} {\rho_{k} = {\frac{1}{4N} + \frac{k - 1}{N}}} & (18) \end{matrix}$

Expression (18) corresponds to an expression obtained by setting δ in expression (4) to ¼N and setting the number K of users or the number K of channels in expression (4) to the code length N. Thus, the code w_(k)[n] becomes an orthogonal code.

In addition, in a case where the second term is (k−1)/N as in expression (18), cos 2πNρ_(k) can be made 0 even if the first term (¼N) in expression (18) is set to ¾N. Therefore, ρ_(k) may be a value represented by the following expression (19).

[Mathematical  19] $\begin{matrix} {\rho_{k} = {\frac{3}{4N} + \frac{k - 1}{N}}} & (19) \end{matrix}$

As described above, δ may be ¼N or ¾N. Here, instead of preventing variation in the autocorrelation, if it is sufficient that variation in the autocorrelation is small, the condition that cos(2πρk) in expression (8) is set to be always “0” for deriving expressions (16) to (19) can be relaxed to the condition that cos(2πρk) in expression (8) is set to be close to “0”. In this case, δ can be set as ⅛N≤δ≤⅜N, or ⅝N≤δ≤⅞N, for example.

[3. Summary Regarding Parameter ρ_(k)]

The code w_(k)[n] using the parameter ρ_(k) determined by δ+(k−1)/K enables reduction in the bit error rate. Here, the symbol δ is a real number not less than 0 but less than 1 (0≤δ<1).

In a case of setting the maximum number K of users or the maximum number K of channels to the same value as the code length N (K=N), the parameter ρ_(k) becomes δ+(k−1)/N. Also in this case, the effect of reducing the bit error rate is obtained. The maximum number K of users or the maximum number K of channels may be set to 2N.

In order to achieve reduction in the bit error rate and achieve a constant autocorrelation value, δ in δ+(k−1)/N is set to a real number greater than 0 and less than 1/N (0<δ<1/N). Preferably, δ is not less than ⅛N (⅛N≤δ), and more preferably, δ is not less than ¼N (¼N≤δ). Preferably, δ is not greater than ⅞N (δ≤⅞N), and more preferably, δ is not greater than ¾N (δ≤¾N). Preferably, δ is not less than ¼N and not greater than ¾N (¼N≤δ≤¾N), and, for example, δ can be set to ½N.

In addition, preferably, δ is not less than ⅛N and not greater than ⅜N (⅛N≤δ ≤⅜N), and, for example, δ can be set to ¼N.

In addition, preferably, δ is not less than ⅝N and not greater than ⅞N (⅝N≤⅞N), and, for example, δ can be set to ¾N.

[4. Bit Error Rate]

FIG. 5 shows bit error rates in a case of determining the parameter ρ_(k) in accordance with expression (4) and in a case of determining the parameter ρ_(k) in accordance with expression (10). In FIG. 5, the horizontal axis indicates the number K of users and the vertical axis indicates the bit error rate. In FIG. 5, (a) shows the bit error rates in asynchronous spread communication in a case of code length N=127, and (b) shows the bit error rates in chip-synchronization spread communication in a case of code length N=1024.

In the case of determining the parameter ρ_(k) in accordance with expression (4), since the number K of users is included in expression (4), the parameter ρ_(k) is optimized per number K of users in accordance with expression (4). On the other hand, in a case of determining the parameter ρ_(k) in accordance with expression (10), since the number K of users is not included in expression (10), the parameter ρ_(k) is determined in a unified manner using the code length N=128 irrespective of the number K of users. In FIG. 5, a bit error rate in a case of Gold code is also shown as a comparative example.

In both cases of determining the parameter ρ_(k) in accordance with expression (4) and determining the parameter ρ_(k) in accordance with expression (10), the bit error rate reduces as compared to the case of Gold code, and thus an excellent result is obtained. From (a) in FIG. 5, it is found that, in the case of determining the parameter ρ_(k) in accordance with expression (10), when the number K of users is equal to the code length N=128 or is close thereto, a bit error rate similar to that in the case of determining the parameter ρ_(k) in accordance with expression (4) is obtained. Similarly, also in (b) of FIG. 5, it is found that, in the case of determining the parameter ρ_(k) in accordance with expression (10), when the number K of users is equal to the code length N=1024 or is close thereto, a bit error rate similar to that in the case of determining the parameter ρ_(k) in accordance with expression (4) is obtained. However, in the case of determining the parameter ρ_(k) in accordance with expression (10), when the number K of users is smaller than the code length N=128, the degree of reduction in the bit error rate becomes small.

The result shown in FIG. 5 shows equivalence between expression (4) and expression (10) in a case of K=N. According to the result shown in FIG. 5, it is found that, in the case of determining the parameter ρ_(k) in accordance with expression (10), by making the code length N variable in accordance with the number K of users or the number K of channels, a bit error rate similar to that in the case of determining the parameter ρ_(k) in accordance with expression (4) is obtained even though the parameter ρ_(k) is determined in accordance with expression (10).

It is noted that, also in the case of determining the parameter ρ_(k) in accordance with expression (4), K may be set to the maximum number of users or the maximum number of channels, instead of the actual number of users or number of channels. In this case, even if the actual number of users or number of channels varies during communication, K does not vary. Therefore, even in the case of determining the parameter ρ_(k) in accordance with expression (4), a bit error rate similar to that in the case of determining the parameter ρ_(k) in accordance with expression (10) is obtained.

[5. How to Use a Plurality of Almost Periodic Function Codes]

The modulator 20 performs modulation using a plurality of (K) almost periodic function codes w_(k)[n]. The symbol K is a number according to the number of users or the number of channels, and by using K codes w_(k)[n], it is possible to modulate transmission signals for K users or K channels.

In a case of communication under an environment in which the number of users or the number of channels does not vary, K may be a constant. In this case, the modulator 20 uses all of the K almost periodic function codes w_(k)[n] for modulation. However, the number of users or the number of channels often varies. Although the modulator 20 may change the value of K in expression (4) in accordance with the value of the number of users or the number of channels, K in expression (4) may be defined as the maximum number of users or the maximum number of channels (constant value). In this case, the modulator 20 selects L almost periodic function codes w_(k)[n] according to the actual number L of users or number L of channels (L≤K), among the K almost periodic function codes w_(k)[n] generated in advance, and uses the selected L almost periodic function codes w_(k)[n] for modulation.

In addition, also in a case of setting the maximum number K of users or the maximum number K of channels to the code length N (K=N), the modulator 20 uses, for modulation, L almost periodic function codes w_(k)[n] according to the actual number of users L or number of channels L (L≤K), among the N almost periodic function codes w_(k)[n]. The communication device 10 changes the code length N in accordance with the number K of users or the number K of channels that varies (N=K), and the modulator 20 can determine the N almost periodic function codes w_(k)[n] on the basis of the changed code length N. In this case, the modulator 20 performs modulation using all of the N almost periodic function codes w_(k)[n]. It is noted that the maximum number K of users or the maximum number K of channels may be set to 2N. In addition, the communication device 10 may change the code length N to K/2 in accordance with the number K of users or the number K of channels that varies.

The plurality of almost periodic function codes w_(k)[n] may be generated by a computer that the communication device 10 has, and may be stored in a storage device that the communication device 10 has. The plurality of almost periodic function codes w_(k)[n] may be, in advance, generated by a computer separate from the communication device 10 and stored in a storage device that the communication device 10 has. The modulator 20 can select all or some of the plurality of almost periodic function codes w_(k)[n] stored in the storage device, and use the selected codes for modulation.

The modulator 20 may use the almost periodic function code w_(k) as a pseudo orthogonal multiplexing modulation code, instead of using as a spread code for spread spectrum communication. The pseudo orthogonal multiplexing modulation is modulation using the almost periodic function code w_(k) and similar to orthogonal multiplexing modulation. Since the almost periodic function code w_(k) is used, this modulation is not exactly orthogonal multiplexing modulation but becomes pseudo orthogonal multiplexing modulation.

In the pseudo orthogonal multiplexing modulation, a data symbol matrix (transmission signal) with a size of N×K is multiplied with a modulation matrix (pseudo orthogonal multiplexing modulation code matrix) with a size of K×N, whereby a modulated signal (pseudo orthogonal multiplexing modulated signal) that is a K×K matrix is outputted. The K×N modulation matrix is formed by arranging N almost periodic function codes w_(k)[n] each having a code length N. In a case where, for example, the almost periodic function codes w_(k)[n] are generated using the parameters ρ_(k) determined in accordance with expression (10) (K=N), the modulation matrix becomes an N×N matrix.

REFERENCE SIGNS LIST

-   -   10 communication device     -   20 modulator 

The invention claimed is:
 1. A communication method using an almost periodic function code, the communication method comprising: using, for modulation, almost periodic function codes a number of which is in accordance with a number of users or a number of channels, among K almost periodic function codes, wherein a parameter that determines each of the K almost periodic function codes is represented by δ+(k−1)/K, where k is an integer from 1 to K and is an identifier for identifying each of the K almost periodic function codes, K is N or 2N, where N is a code length of each almost periodic function code, and δ is a real number greater than 0 and less than 1/N, and δ is in a range of ¼N≤δ≤¾N.
 2. The communication method according to claim 1, wherein δ is ½N.
 3. The communication method according to claim 2, wherein δ is a rational number.
 4. The communication method according to claim 1, wherein δ is a rational number.
 5. A communication method using an almost periodic function code, the communication method comprising: using, for modulation, almost periodic function codes a number of which is in accordance with a number of users or a number of channels, among K almost periodic function codes, wherein a parameter that determines each of the K almost periodic function codes is represented by δ+(k−1)/K, where k is an integer from 1 to K and is an identifier for identifying each of the K almost periodic function codes, K is N or 2N, where N is a code length of each almost periodic function code, and δ is a real number greater than 0 and less than 1/N, and δ is in a range of ⅛N≤δ≤⅜N.
 6. The communication method according to claim 5, wherein δ is ¼N.
 7. The communication method according to claim 6, wherein δ is a rational number.
 8. The communication method according to claim 5, wherein δ is a rational number.
 9. A communication method using an almost periodic function code, the communication method comprising: using, for modulation, almost periodic function codes a number of which is in accordance with a number of users or a number of channels, among K almost periodic function codes, wherein a parameter that determines each of the K almost periodic function codes is represented by δ+(k−1)/K, where k is an integer from 1 to K and is an identifier for identifying each of the K almost periodic function codes, K is N or 2N, where N is a code length of each almost periodic function code, and δ is in a range of ⅝N≤δ≤⅞N.
 10. The communication method according to claim 9, wherein δ is ¾N.
 11. The communication method according to claim 10, wherein δ is a rational number.
 12. The communication method according to claim 9, wherein δ is a rational number.
 13. A communication device performing communication using an almost periodic function code, the communication device comprising: a modulator configured to use, for modulation, almost periodic function codes a number of which is in accordance with a number of users or a number of channels, among K almost periodic function codes, wherein a parameter that determines each of the K almost periodic function codes is represented by δ+(k−1)/K, where k is an integer from 1 to K and is an identifier for identifying each of the K almost periodic function codes, K is N or 2N, where N is a code length of each almost periodic function code, and δ is a real number greater than 0 and less than 1/N, and δ is in a range of ¼N≤δ≤¾N. 